Hierarchic Voronoi skeletons
نویسندگان
چکیده
Robust and time-efficient skeletonization of a (planar) shape, which is connectivity preserving and based on Euclidean metrics, can be achieved by first regularizing the Voronoi diagram (VD) of a shape’s boundary points, i.e., by removal of noise-sensitive parts of the tessellation and then by establishing a hierarchic organization of skeleton constituents . Each component of the VD is attributed with a measure of prominence which exhibits the expected invariance under geometric transformations and noise. The second processing step, a hierarchic clustering of skeleton branches, leads to a multiresolution representation of the skeleton, termed skeleton pyramid. Index terms — Distance transform, hierarchic skeletons, medial axis, regularization, shape description, thinning, Voronoi tessellation.
منابع مشابه
Pii: S0925-7721(01)00056-6
We tackle the problem of computing the Voronoi diagram of a 3-D polyhedron whose faces are planar. The main difficulty with the computation is that the diagram’s edges and vertices are of relatively high algebraic degrees. As a result, previous approaches to the problem have been non-robust, difficult to implement, or not provenly correct. We introduce three new proximity skeletons related to t...
متن کاملStraight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions
We consider the question under which circumstances the straight skeleton and the Voronoi diagram of a given input shape coincide. More precisely, we investigate convex distance functions that stem from centrally symmetric convex polyhedra as unit balls and derive sufficient and necessary conditions for input shapes in order to obtain identical straight skeletons and Voronoi diagrams with respec...
متن کاملRecognition of Handwritten Characters by Voronoi Representations Recognition of Handwritten Characters by Voronoi Representations
We present a new skeletonization algorithm well suited for the problem of handprinted character recognition. Our approach employs a novel algorithm for computing the Voronoi diagram of a polygon with holes. We show that Voronoi skeletons can serve as eecient shape descriptors because they preserve connectivity and Euclidean metrics. Compared to traditional skeletonization techniques, we suggest...
متن کاملUsing Polyballs to Approximate Shapes and Skeletons
This paper presents an approach to approximate the skeleton of continuous shapes either in 2D or 3D space. The data required is a sampling of the boundary of the shape. We call polyball any nite union of balls. A preliminary work on polyballs shows that their skeletons consist of simple components (line segments in 2D and polygons in 3D). To construct these components, only the computation of a...
متن کاملAsymptotic theory for statistics of the Poisson-Voronoi approximation
This paper establishes expectation and variance asymptotics for statistics of the Poisson-Voronoi approximation of general sets, as the underlying intensity of the Poisson point process tends to infinity. Statistics of interest include volume, surface area, Hausdorff measure, and the number of faces of lower-dimensional skeletons. We also consider the complexity of the so-called Voronoi zone an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 28 شماره
صفحات -
تاریخ انتشار 1995